首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   79773篇
  免费   633篇
  国内免费   659篇
化学   25444篇
晶体学   812篇
力学   6823篇
综合类   8篇
数学   32255篇
物理学   15723篇
  2023年   54篇
  2022年   49篇
  2021年   79篇
  2020年   123篇
  2019年   95篇
  2018年   10478篇
  2017年   10310篇
  2016年   6153篇
  2015年   942篇
  2014年   393篇
  2013年   452篇
  2012年   3937篇
  2011年   10658篇
  2010年   5714篇
  2009年   6156篇
  2008年   6696篇
  2007年   8862篇
  2006年   300篇
  2005年   1390篇
  2004年   1572篇
  2003年   1997篇
  2002年   1039篇
  2001年   282篇
  2000年   329篇
  1999年   186篇
  1998年   220篇
  1997年   172篇
  1996年   240篇
  1995年   159篇
  1994年   112篇
  1993年   120篇
  1992年   77篇
  1991年   95篇
  1990年   76篇
  1989年   72篇
  1988年   73篇
  1987年   71篇
  1986年   68篇
  1985年   56篇
  1984年   53篇
  1983年   40篇
  1982年   49篇
  1981年   43篇
  1980年   50篇
  1979年   49篇
  1914年   45篇
  1913年   40篇
  1912年   40篇
  1909年   41篇
  1908年   40篇
排序方式: 共有10000条查询结果,搜索用时 125 毫秒
41.
In the paper, the authors establish several integral representations for the generating functions of the large and little Schröder numbers and for the large and little Schröder numbers.  相似文献   
42.
43.
A sensitive, rapid and novel measurement method for cytokeratin 19 fragment (CYFRA 21–1) in human serum by magnetic particle-based time-resolved fluoroimmunoassay (TRFIA) is described. Built on a sandwich-type immunoassay format, analytes in samples were captured by one monoclonal antibody coating onto the surface of magnetic beads and “sandwiched” by another monoclonal antibody labeled with europium chelates. The coefficient variations of the method were lower than 7 %, and the recoveries were in the range of 90–110 % for serum samples. The lower limit of quantitation of the present method for CYFRA 21–1 was 0.78 ng/ml. The correlation coefficient of CYFRA 21–1 values obtained by our novel TRFIA and CLIA was 0.980. The present novel TRFIA demonstrated high sensitivity, wider effective detection range and excellent reproducibility for determination of CYFRA 21–1 can be useful for early screening and prognosis evaluation of patients with non-small cell lung cancer.  相似文献   
44.
45.
Ni–Co alloys have a wide range of applications in various fields owning to their excellent physical, chemical, and mechanical properties. In this paper, we prepare Ni–Co alloy coatings on 316L stain steel surfaces by electroplating. We present a novel approach utilizing a nanosecond laser to induce microtextures on Ni–Co alloy coatings. We study experimentally the effects of laser power and scanning rate on the surface morphologies of Ni–Co alloy coatings. The results indicate that the shape and size of induced microtextures can be controlled by the laser power and scanning rate. The size of grains increases with increase in the work current of the laser (WCL) at a certain scanning rate. With the WCL constant, the size of grains decreases with increase in scanning rate while their average height increases. It is a simple and easily-controlled method for the fabrication of microstructures on Ni–Co alloy coatings, which has promising applications in investigations of the properties of microtextured surfaces, such as friction, adhesion, and wetting.  相似文献   
46.
Due-dates are often determined during sales negotiations in two stages: (i) in the pre-sale stage, the customer provides a time interval (due-window) of his acceptable due-dates, (ii) in the second stage, the parties agree on the delivery penalties. Thus, the contract reflects penalties of both parts of the sales negotiations: earliness/tardiness penalties of the due-dates (as a function of the deviation from the agreed upon due-window), and earliness/tardiness penalties of the actual delivery times (as a function of the deviation from the due-dates). We model this setting of a two-stage negotiation on a single machine, and reduce the problem to a well-known setting of minimizing the weighted earliness/tardiness with a given (fixed) due-window. We adopt (and correct) a pseudo-polynomial dynamic programming algorithm for this NP-hard problem. The algorithm is extended to a setting of parallel identical machines, verifying that this case remains NP-hard in the ordinary sense. Moreover, an efficient greedy heuristic and a tight lower bound are introduced and tested. Extremely small optimality gaps are obtained in our numerical tests.  相似文献   
47.
48.
49.
50.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号